On Two-Stage Stochastic Knapsack Problems with or without Probability Constraint

نویسندگان

  • Stefanie Kosuch
  • Abdel Lisser
چکیده

In this paper we study a particular version of the stochastic knapsack problem with normally distributed weights: the two-stage stochastic knapsack problem. In contrary to the single-stage knapsack problem, items can be added to or removed from the knapsack at the moment the actual weights come to be known (second stage). In addition, a probability constraint is introduced in the first stage in order to restrict the percentage of cases where the items chosen lead to an overload in the second stage. To the best of our knowledge, there is no method known to exactly evaluate the objective function for a given first-stage solution. Therefore, we propose methods to calculate upper and lower bounds. These bounds are used in a branch-and-bound framework in order to search the first-stage solution space. Special interest is given to the case where the items have similar weight means. Numerical results are presented and analyzed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knapsack problem with probability constraints

This paper is dedicated to a study of different extensions of the classical knapsack problem to the case when different elements of the problem formulation are subject to a degree of uncertainty described by random variables. This brings the knapsack problem into the realm of stochastic programming. Two different model formulations are proposed, based on the introduction of probability constrai...

متن کامل

Stochastic Quadratic Knapsack with Recourse

This paper is dedicated to a study of different extensions of the classical knapsack problem to the case when different elements of the problem formulation are subject to a degree of uncertainty described by random variables. This brings the knapsack problem into the realm of stochastic programming. Four different model formulations are proposed, based on the introduction of probability constra...

متن کامل

Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack

The stochastic knapsack problem is the stochastic variant of the classical knapsack problem in which the algorithm designer is given a a knapsack with a given capacity and a collection of items where each item is associated with a profit and a probability distribution on its size. The goal is to select a subset of items with maximum profit and violate the capacity constraint with probability at...

متن کامل

A Two-Stage Chance-Constraint Stochastic Programming Model for Electricity Supply Chain Network Design

Development of every society is incumbent upon energy sector’s technological and economic effectiveness. The electricity industry is a growing and needs to have a better performance to effectively cover the demand. The industry requires a balance between cost and efficiency through careful design and planning. In this paper, a two-stage stochastic programming model is presented for the design o...

متن کامل

Three Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint

Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010